Lâmi'î Çelebi'nin Şevâhidü'n-Nübüvve Tercümesi'ne İlâveleri ve Moton Kalesi Feti

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dual-Primal FETI Method

The FETI algorithms are numerically scalable iterative domain decomposition methods. These methods are well documented for solving equations arising from the Finite Element discretization of second or fourth order elasticity problems. The one level FETI method equipped with the Dirichlet preconditioner was shown to be numerically scalable for second order elasticity problems while the two level...

متن کامل

Regularized formulations of FETI

FETI 205 A conforming FEM for (2.7) results in the discrete optimality system   K1 0 B T 1 0 0 K̃2 −B2 −C2 Υ B1 −B2 0 0 0 −ΥC2 0 Υ     u1 u2 λ μ   =   f1 f2 0 0   (2.8) where K̃2 ≡ K2 +C2 ΥC2. Elimination of the primal variables in (2.8) results in the coarse grid problem [ B1K −1 1 B T 1 +B2K̃ −1 2 B T 2 B2K̃ −1 2 C T 2 Υ ΥC2K̃ −1 2 B T 2 ΥC2K̃ −1 2 C T 2 Υ−Υ ] [ λ μ ] = [ d1 d1 ] ...

متن کامل

FETI-DP Domain Decomposition Method

School of Basic Science Mathematics Section Master in Mathematical Engineering FETI-DP Domain Decomposition Method by Christoph Jäggli FETI-DP is a dual iterative, nonoverlapping domain decomposition method. By a Schur complement procedure, the solution of a boundary value problem is reduced to solving a symmetric and positive definite dual problem in which the variables are directly related to...

متن کامل

1 . Regularized formulations of FETI

FETI 3 Theorem 2.1 (u1, u2, λ) solves (2.4) if and only if (u1, u2, λ, μ = c(u2)) solves (2.7). Proof. The theorem is easily established by using the stabilized constraints (2.5) and recalling that τ = 0. The theorem demonstrates that (2.5) represents a consistent stabilization. The impact of this innocuous sleight of hand is that the resulting coarse grid problem is equivalently stabilized. We...

متن کامل

Simultaneous-FETI and Block-FETI: robust domain decomposition with multiple search directions

Domain Decomposition methods often exhibit very poor performance when applied to engineering problems with large heterogeneities. In particular for heterogeneities along domain interfaces the iterative techniques to solve the interface problem are lacking an efficient preconditioner. Recently a robust approach, named FETI-Geneo, was proposed where troublesome modes are precomputed and deflated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Turkish Studies

سال: 2016

ISSN: 1308-2140

DOI: 10.7827/turkishstudies.10107